Improved KNN Algorithm for Fine-Grained Classification of Encrypted Network Flow
نویسندگان
چکیده
منابع مشابه
An Improved Algorithm for Network Reliability Evaluation
Binary Decision Diagram (BDD) is a data structure proved to be compact in representation and efficient in manipulation of Boolean formulas. Using Binary decision diagram in network reliability analysis has already been investigated by some researchers. In this paper we show how an exact algorithm for network reliability can be improved and implemented efficiently by using CUDD - Colorado Univer...
متن کاملAn Improved KNN Text Classification Algorithm Based on Clustering
The traditional KNN text classification algorithm used all training samples for classification, so it had a huge number of training samples and a high degree of calculation complexity, and it also didn’t reflect the different importance of different samples. In allusion to the problems mentioned above, an improved KNN text classification algorithm based on clustering center is proposed in this ...
متن کاملIs Fine Grained Classification Different?
We performed experiments on two fine-grained classification tasks using a state-of-the-art pipeline (descriptor + dictionary + LLC encoding + max pooling + linear SVM). We found that this standard pipeline out-performed a dictionary-free classification technique (stacked evidence trees) that was specifically designed for fine-grained classification. The success of the method depends on two fact...
متن کاملCollective Classification for Fine-grained Information Status
Previous work on classifying information status (Nissim, 2006; Rahman and Ng, 2011) is restricted to coarse-grained classification and focuses on conversational dialogue. We here introduce the task of classifying finegrained information status and work on written text. We add a fine-grained information status layer to the Wall Street Journal portion of the OntoNotes corpus. We claim that the in...
متن کاملFine-Grained Algorithm Design for Matchin
Finding maximum-cardinality matchings in undirected graphs is arguably one of the most central graph problems. For m-edge and n-vertex graphs, it is well-known to be solvable in O(m √ n) time; however, for several applications this running time is still too slow. Improving this worst-case upper bound resisted decades of research. In this paper we mainly focus on parameterizations of the input w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronics
سال: 2020
ISSN: 2079-9292
DOI: 10.3390/electronics9020324